See Fermat's little theorem in All languages combined, or Wiktionary
{
"etymology_templates": [
{
"args": {
"1": "lawyer and amateur mathematician",
"2": "",
"3": "",
"4": "",
"5": ""
},
"expansion": "lawyer and amateur mathematician",
"name": "named-after/list"
},
{
"args": {},
"expansion": "|",
"name": "!"
},
{
"args": {
"1": "en",
"2": "Pierre de Fermat"
},
"expansion": "Pierre de Fermat",
"name": "lang"
},
{
"args": {
"1": "en",
"2": "Pierre de Fermat",
"born": "1601",
"died": "1665",
"nat": "French",
"occ": "lawyer and amateur mathematician",
"wplink": "="
},
"expansion": "Named after French lawyer and amateur mathematician Pierre de Fermat (1601–1665)",
"name": "named-after"
}
],
"etymology_text": "Named after French lawyer and amateur mathematician Pierre de Fermat (1601–1665), who stated a version of the theorem in a letter in 1640. Called little to distinguish it from Fermat's Last Theorem.",
"head_templates": [
{
"args": {},
"expansion": "Fermat's little theorem",
"name": "en-proper noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "Entries with translation boxes",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with French translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Hungarian translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Italian translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Russian translations",
"parents": [],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Number theory",
"orig": "en:Number theory",
"parents": [
"Mathematics",
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"examples": [
{
"text": "1999, John Stillwell, Translator's introduction, Peter Gustav Lejeune Dirichlet, Richard Dedekind (supplements), Lectures on Number Theory, [1863, P. G. Lejeune Dirichlet, R. Dedekind, Vorlesungen über Zahlentheorie], American Mathematical Society, page xi,\nWhen combined with the historical remarks made by Gauss himself, they give a bird's eye view of number theory from approximately 1640 to 1840 - from Fermat's little theorem to L-functions - the period which produced the problems and ideas which are still at the center of the subject."
},
{
"text": "1999, Siguna Müller, On the Combined Fermat/Lucas Probable Prime Test, Michael Walker (editor), Cryptography and Coding: 7th IMA International Conference, Springer, LNCS 1746, page 222,\nMost of the pseudoprimality tests originate in some sense on Fermat's Little Theorem aⁿ⁻¹ ≡ 1 mod n."
},
{
"ref": "2007, Thomas Koshy, Elementary Number Theory with Applications, 2nd edition, Elsevier (Academic Press), page 327:",
"text": "Incidentally, the special case of Fermat's little theorem for a = 2 was known to the Chinese as early as 500 B.C.\nThe first proof of Fermat's little theorem was given by Euler in 1736, almost a century after Fermat's announcement.",
"type": "quote"
},
{
"ref": "2008, Lawrence C. Washington, Elliptic Curves: Number Theory and Cryptography, 2nd edition, Taylor & Francis (Chapman & Hall/CRC), page 189:",
"text": "Fermat's little theorem says that if n is prime and gcd(a,n) = 1, then aⁿ⁻¹ ≡ 1 (mod n), so it follows that n must be composite, even though we have not produced a factor.",
"type": "quote"
}
],
"glosses": [
"The theorem that, for any prime number p and integer a, aᵖ-a is an integer multiple of p."
],
"id": "en-Fermat's_little_theorem-en-name-~LgFIm5m",
"links": [
[
"number theory",
"number theory"
],
[
"prime number",
"prime number"
]
],
"raw_glosses": [
"(number theory) The theorem that, for any prime number p and integer a, aᵖ-a is an integer multiple of p."
],
"related": [
{
"word": "Euler's totient function"
}
],
"synonyms": [
{
"sense": "Fermat's theorem",
"word": "theorem that a p − a is divisible by p"
},
{
"word": "Fermat's Little Theorem"
}
],
"topics": [
"mathematics",
"number-theory",
"sciences"
],
"translations": [
{
"code": "fr",
"lang": "French",
"sense": "theorem that ap − a is divisible by p",
"word": "petit théorème de Fermat"
},
{
"code": "hu",
"lang": "Hungarian",
"sense": "theorem that ap − a is divisible by p",
"word": "kis Fermat-tétel"
},
{
"code": "it",
"lang": "Italian",
"sense": "theorem that ap − a is divisible by p",
"tags": [
"masculine"
],
"word": "piccolo teorema di Fermat"
},
{
"code": "ru",
"lang": "Russian",
"roman": "malaja teorema Ferma",
"sense": "theorem that ap − a is divisible by p",
"word": "малая теорема Ферма"
}
],
"wikipedia": [
"Fermat's little theorem"
]
}
],
"word": "Fermat's little theorem"
}
{
"etymology_templates": [
{
"args": {
"1": "lawyer and amateur mathematician",
"2": "",
"3": "",
"4": "",
"5": ""
},
"expansion": "lawyer and amateur mathematician",
"name": "named-after/list"
},
{
"args": {},
"expansion": "|",
"name": "!"
},
{
"args": {
"1": "en",
"2": "Pierre de Fermat"
},
"expansion": "Pierre de Fermat",
"name": "lang"
},
{
"args": {
"1": "en",
"2": "Pierre de Fermat",
"born": "1601",
"died": "1665",
"nat": "French",
"occ": "lawyer and amateur mathematician",
"wplink": "="
},
"expansion": "Named after French lawyer and amateur mathematician Pierre de Fermat (1601–1665)",
"name": "named-after"
}
],
"etymology_text": "Named after French lawyer and amateur mathematician Pierre de Fermat (1601–1665), who stated a version of the theorem in a letter in 1640. Called little to distinguish it from Fermat's Last Theorem.",
"head_templates": [
{
"args": {},
"expansion": "Fermat's little theorem",
"name": "en-proper noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"related": [
{
"word": "Euler's totient function"
}
],
"senses": [
{
"categories": [
"English entries with incorrect language header",
"English eponyms",
"English lemmas",
"English multiword terms",
"English proper nouns",
"English terms with quotations",
"English uncountable nouns",
"Entries with translation boxes",
"Pages with 1 entry",
"Pages with entries",
"Terms with French translations",
"Terms with Hungarian translations",
"Terms with Italian translations",
"Terms with Russian translations",
"en:Number theory"
],
"examples": [
{
"text": "1999, John Stillwell, Translator's introduction, Peter Gustav Lejeune Dirichlet, Richard Dedekind (supplements), Lectures on Number Theory, [1863, P. G. Lejeune Dirichlet, R. Dedekind, Vorlesungen über Zahlentheorie], American Mathematical Society, page xi,\nWhen combined with the historical remarks made by Gauss himself, they give a bird's eye view of number theory from approximately 1640 to 1840 - from Fermat's little theorem to L-functions - the period which produced the problems and ideas which are still at the center of the subject."
},
{
"text": "1999, Siguna Müller, On the Combined Fermat/Lucas Probable Prime Test, Michael Walker (editor), Cryptography and Coding: 7th IMA International Conference, Springer, LNCS 1746, page 222,\nMost of the pseudoprimality tests originate in some sense on Fermat's Little Theorem aⁿ⁻¹ ≡ 1 mod n."
},
{
"ref": "2007, Thomas Koshy, Elementary Number Theory with Applications, 2nd edition, Elsevier (Academic Press), page 327:",
"text": "Incidentally, the special case of Fermat's little theorem for a = 2 was known to the Chinese as early as 500 B.C.\nThe first proof of Fermat's little theorem was given by Euler in 1736, almost a century after Fermat's announcement.",
"type": "quote"
},
{
"ref": "2008, Lawrence C. Washington, Elliptic Curves: Number Theory and Cryptography, 2nd edition, Taylor & Francis (Chapman & Hall/CRC), page 189:",
"text": "Fermat's little theorem says that if n is prime and gcd(a,n) = 1, then aⁿ⁻¹ ≡ 1 (mod n), so it follows that n must be composite, even though we have not produced a factor.",
"type": "quote"
}
],
"glosses": [
"The theorem that, for any prime number p and integer a, aᵖ-a is an integer multiple of p."
],
"links": [
[
"number theory",
"number theory"
],
[
"prime number",
"prime number"
]
],
"raw_glosses": [
"(number theory) The theorem that, for any prime number p and integer a, aᵖ-a is an integer multiple of p."
],
"topics": [
"mathematics",
"number-theory",
"sciences"
],
"wikipedia": [
"Fermat's little theorem"
]
}
],
"synonyms": [
{
"sense": "Fermat's theorem",
"word": "theorem that a p − a is divisible by p"
},
{
"word": "Fermat's Little Theorem"
}
],
"translations": [
{
"code": "fr",
"lang": "French",
"sense": "theorem that ap − a is divisible by p",
"word": "petit théorème de Fermat"
},
{
"code": "hu",
"lang": "Hungarian",
"sense": "theorem that ap − a is divisible by p",
"word": "kis Fermat-tétel"
},
{
"code": "it",
"lang": "Italian",
"sense": "theorem that ap − a is divisible by p",
"tags": [
"masculine"
],
"word": "piccolo teorema di Fermat"
},
{
"code": "ru",
"lang": "Russian",
"roman": "malaja teorema Ferma",
"sense": "theorem that ap − a is divisible by p",
"word": "малая теорема Ферма"
}
],
"word": "Fermat's little theorem"
}
Download raw JSONL data for Fermat's little theorem meaning in English (4.2kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-12-21 from the enwiktionary dump dated 2024-12-04 using wiktextract (d8cb2f3 and 4e554ae). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.